package com.major.search.fib;

public class Fib {
    public static int[] fib(int length) {
        int[] f = new int[length];
        f[0] = 1;
        f[1] = 1;
        for (int i = 2; i < length; i++) {
            f[i] = f[i - 1] + f[i - 2];
        }
        return f;
    }
}
